Ieee Transactions on Computer-aided Design of Integrated Circuits and Systems

نویسندگان

  • Qiaoyan Yu
  • Paul Ampadu
چکیده

We present a fast parallel simulator to evaluate the impact of different error control methods on the performance of networks-on-chip (NoCs). The simulator, implemented with message passing interface (MPI) language to exploit multiprocessor server environments, models characteristics of intellectual property (IP) cores, network interfaces (NIs), and routers. Moreover, different error control schemes can be inserted to the simulator in a plug-and-play manner for evaluation. A highly tunable fault injection feature allows estimation of the latency, throughout and energy consumption of an error control scheme against different fault types, fault injection locations and traffic injections. Case NoC studies are presented to demonstrate how the simulator assists in NoC design space exploration, evaluating the impact of different error control methods on NoC performance, and providing design guidelines for NoCs with error control capabilities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Machine Learning Attacks on PolyPUF, OB-PUF, RPUF, and PUF-FSM

A physically unclonable function (PUF) is a circuit of which the input– output behavior is designed to be sensitive to the random variations of its manufacturing process. This building block hence facilitates the authentication of any given device in a population of identically laid-out silicon chips, similar to the biometric authentication of a human. The focus and novelty of this work is the ...

متن کامل

Minimization of Exclusive Sum-of-Products Expressions for Multiple-Valued Input, Incompletely Specif - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

This paper presents a new operation (exorlink) and an algorithm to minimize Exclusive-OR Sum-of-Products expressions (ESOP’s) for multiple valued input, two valued output, incompletely specified functions. Exorlink is a more powerful operation than any other existing one for this problem. Evaluation on benchmark functions is given and it proves the superiority of the program to those known from...

متن کامل

Low-pass filter for computing the transition density in digital circuits

Estimating the power dissipation and the reliability of integrated circuits is a major concern of the semiconductor industry. Previously [1], we showed that a good measure of power dissipation and reliability is the extent of circuit switching activity, called the transition density. However, the algorithm for computing the density in [1] is very basic and does not take into account the e ect o...

متن کامل

An extension of probabilistic simulation for reliability analysis of CMOS VLSI circuits

The probabilistic simulation approach [1] is extended to include the computation of the variance waveform of the power/ground current, in addition to its expected waveform. To provide the motivation for doing this, we focus on the problem of estimating the median timeto-failure (MTF) due to electromigration in the power and ground busses of CMOS circuits. New theoretical results are presented t...

متن کامل

SPAR: a schematic place and route system

This paper presents an approach to the automatic generation of schematic diagrams from circuit descriptions. The heuristics which make up the system are based on two principles of schematics readability: Functional Identi cation and Traceability. SPAR's generation process is broken into ve distinct phases: partitioning the netlist, placement of components on the page, global routing, local rout...

متن کامل

New Performance-Driven FPGA Routing Algorithms - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions significantly outperform the best known ones and have provably good performance bounds. Our arborescence heuristics produce routing solutions with optimal source–sink pathlengths, and with wirelength on par with the best exist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009